Zigzag polynomials, Artin's conjecture and trinomials

نویسندگان

چکیده

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The considered are seen to be determined up change bases a single number. Studying this number leads new family polynomials which exhibit special properties. These satisfy three term recursion and closely related zigzag zero-one sequences. Interpreting the for "prime" 1 yields classical Morgan-Voyce polynomials, form twoorthogonal families have applications study electrical resistance. Study general reveals deep connections with Fibonacci series, order appearance numbers sequence, elements cyclic groups, Artin's conjecture on primitive roots factorization trinomials over finite fields.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revstack Sort, Zigzag Patterns, Descent Polynomials of $t$-revstack Sortable Permutations, and Steingrímsson's Sorting Conjecture

In this paper we examine the sorting operator T (LnR) = T (R)T (L)n. Applying this operator to a permutation is equivalent to passing the permutation reversed through a stack. We prove theorems that characterise t-revstack sortability in terms of patterns in a permutation that we call zigzag patterns. Using these theorems we characterise those permutations of length n which are sorted by t appl...

متن کامل

New Permutation Trinomials Constructed from Fractional Polynomials

Permutation trinomials over finite fields consititute an active research due to their simple algebraic form, additional extraordinary properties and their wide applications in many areas of science and engineering. In the present paper, six new classes of permutation trinomials over finite fields of even characteristic are constructed from six fractional polynomials. Further, three classes of p...

متن کامل

Divisibility of Trinomials by Irreducible Polynomials over F_2

Irreducible trinomials of given degree n over F2 do not always exist and in the cases that there is no irreducible trinomial of degree n it may be effective to use trinomials with an irreducible factor of degree n. In this paper we consider some conditions under which irreducible polynomials divide trinomials over F2. A condition for divisibility of selfreciprocal trinomials by irreducible poly...

متن کامل

Test polynomials, retracts, and the Jacobian conjecture

Let K[x, y] be the algebra of two-variable polynomials over a field K. A polynomial p = p(x, y) is called a test polynomial for automorphisms if, whenever φ(p) = p for a mapping φ of K[x, y], this φ must be an automorphism. Here we show that p ∈ C[x, y] is a test polynomial if and only if p does not belong to any proper retract of C[x, y]. This has the following corollary that may have applicat...

متن کامل

Hessian Nilpotent Polynomials and the Jacobian Conjecture

Let z = (z1, · · · , zn) and ∆ = ∑n i=1 ∂ 2 ∂z i the Laplace operator. The main goal of the paper is to show that the wellknown Jacobian conjecture without any additional conditions is equivalent to the following what we call vanishing conjecture: for any homogeneous polynomial P (z) of degree d = 4, if ∆P(z) = 0 for all m ≥ 1, then ∆P(z) = 0 when m >> 0, or equivalently, ∆P(z) = 0 when m > 3 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Finite Fields and Their Applications

سال: 2023

ISSN: ['1090-2465', '1071-5797']

DOI: https://doi.org/10.1016/j.ffa.2023.102198